Efficient practical Byzantine consensus using random linear network coding

Abstract Using random linear network coding (RLNC) in asynchronous networks with one-to-many information flow has already been proven to be a valid approach maximize the channel capacities. Message-based consensus protocols such as practical Byzantine fault tolerance (pBFT) adhere partially said scenario. Protocol phases many-to-many communication, however, still suffer from quadratic growth number of required transmissions reach consensus. We show that an enhancement data transmission behavior is possible through combining RLNC pBFT one hybrid protocol. present several experiments conducted on topologies. conclude using RLNC-based offers significantly better performance under specific circumstances, which depend participating nodes and chosen parameters. Applying same other combinations message-based promises not only gain performance, but may also improve robustness security open up new application scenarios for RLNC, e.g., running it layer.